Online Supplement to “Minimax Models for Diverse Routing”
نویسندگان
چکیده
Twenty-four algorithmic variants of the path-generation approach were investigated, based on the formulated LP model (MMP, MMD), the LP solution method (primal, dual), the pricing mechanism (single, multiple, partial), and the selection of dual variables (extreme-point, interior-point). Table I summarizes the codings used to specify these 24 algorithms. In option C, the master problem was solved using CPLEX’s CPXoptimize (primal simplex) routine; in option D, the CPXdualopt (dual simplex) routine was used. In addition to using the extreme-point duals (option H) produced by solving the restricted minimax LP, we also considered selecting interior-point duals (option I) to make as many dual variables positive as possible, in effect spreading the penalties over more arcs. To accomplish this we solved the following quadratic program using CPLEX’s CPXbaropt routine:
منابع مشابه
Designing and implementing a Web-based real time routing service for crisis management (a case study for district 11 of Tehran)
Timing framework associated with catastrophes is one of the most important issues in crisis management. In such cases, being immediate has a considerable importance and web based real-time routing service as an important tool has a significant role in relief operations improvement. At this study, a web-based real time routing service based on open source technology has designed for 11th distric...
متن کاملModeling of VANET Technology & Ad-Hoc Routing Protocols Based on High Performance Random Waypoint Models
Today, one of the new technologies in the modern era is Vehicular Ad-hoc Network which has takenenormous attention in the recent years. Because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called V2V orvehicle to vehicle communication and vehicle to roadside infrastructure, called V2I. Designin...
متن کاملAchievability of Asymptotic Minimax Regret in Online and Batch Prediction
The normalized maximum likelihood model achieves the minimax coding (log-loss) regret for data of fixed sample size n. However, it is a batch strategy, i.e., it requires that n be known in advance. Furthermore, it is computationally infeasible for most statistical models, and several computationally feasible alternative strategies have been devised. We characterize the achievability of asymptot...
متن کاملEnhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing
متن کامل
Comparison between Combined and Separate Approaches for Solving a Location-Routing Problem in Hazardous Materials Transportation
In the case of hazardous materials management, selected routes for carrying hazardous materials (i.e., hazmat) have significant effects on locating hazmat distribution centers. Since, risk and cost are usually considered as two main attributes to determine the best routes, optimized locations are sequentially outlined depending on selected routes. In the present paper, t...
متن کامل